Personalizing Forum Search using Multidimensional Random Walks
نویسندگان
چکیده
Online forums are a vital resource for users to ask questions and to participate in discussions. Yet, the search functionality on such forum sites is very primitive; posts containing the searched keywords are retrieved in the order of their creation date. In these interactive and social web forum sites, users frequently make connections with other users due to shared interests, same information needs or similar profiles. A critical challenge then, is to score and rank the forum posts while taking into account these relations between users. In this paper, we present a personalized search over forums that leverages user similarities developed via multiple relations linking users. We build a novel multidimensional random walk model that uniformly incorporates the heterogeneous user relations to find similar forum participants. We then use this multi-relational user similarity to predict future interactions by personalizing answer search. Furthermore, we extend our methods to enhance keyword search for forum readers, by using expertise scores for all existing forum participants. Our results show that by leveraging the author dimension we can retrieve more relevant results than the traditional IR scoring alone.
منابع مشابه
A Theoretical Framework for Studying Random Walk Planning
Random walks are a relatively new component used in several state of the art satisficing planners. Empirical results have been mixed: while the approach clearly outperforms more systematic search methods such as weighted A* on many planning domains, it fails in many others. So far, the explanations for these empirical results have been somewhat ad hoc. This paper proposes a formal framework for...
متن کاملReducing Search Lengths with Locally Precomputed Partial Random Walks
Random walks can be used to search complex networks for a desired resource. To reduce the number of hops necessary to find resources, we propose a search mechanism based on building random walks connecting together partial walks that have been precomputed at each network node in an initial stage. The resources found in each partial walk are registered in its associated Bloom filter. Searches ca...
متن کاملMultidimensional Random Walks in Random Environments with Subclassical Limiting Behavior
In this paper we wilt describe and analyze a class of multidimensional random walks in random environments which contain the one dimensional nearest neighbor situation as a special case and have the pleasant feature that quite a lot can be said about them. Our results make rigorous a heuristic argument of Marinari et al. (1983), and show that in any d < cc we can have (a)X, is recurrent and (b ...
متن کاملMultitarget search on complex networks: A logarithmic growth of global mean random cover time.
We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target numbe...
متن کاملRandom Walks in Cones
We study the asymptotic behaviour of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step in the proof consists in constructing a positive harmonic function for our random walk under minimal moment restrictions on the increments. For the proof of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014